Induction and transfinite induction in intuitionistic systems
نویسندگان
چکیده
منابع مشابه
Transfinite Induction within Peano Arithmetic
The relative strengths of first-order theories axiomatized by transfinite induction, for ordinals less-than ~0, and formulas restricted in quantifier complexity, is determined. This is done, in part, by describing the provably recursive functions of such theories. Upper bounds for the provably recursive functions are obtained using model-theoretic techniques. A variety of additional results tha...
متن کاملEpsilon substitution for transfinite induction
We apply Mints’ technique for proving the termination of the epsilon substitution method via cut-elimination to the system of Peano Arithmetic with Transfinite Induction given by Arai.
متن کاملArithmetical transfinite induction and hierarchies of functions
We generalize to the case of arithmetical transfinite induction the following three theorems for PA: the Wainer Theorem, the Paris–Harrington Theorem, and a version of the Solovay–Ketonen Theorem. We give uniform proofs using combinatorial constructions.
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولPolynomial induction and length minimization in intuitionistic bounded arithmetic
It is shown that the feasibly constructive arithmetic theory IPV does not prove (double negation of) LMIN(NP), unless the polynomial hierarchy CPV-provably collapses. It is proved that PV plus (double negation of) LMIN(NP) intuitionistically proves PIND(coNP). It is observed that PV+ PIND(NP∪coNP) does not intuitionistically prove NPB, a scheme which states that the extended Frege systems are n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1972
ISSN: 0003-4843
DOI: 10.1016/0003-4843(72)90014-9